By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 17, Issue 1, pp. 1-178

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On Bounded Database Schemes and Bounded Horn-Clause Programs

Yehoshua Sagiv

pp. 1-22

BibTeX  Abstract Full Text:  PDF

Analysis of a Hybrid Algorithm for Packing Unequal Bins

D. K. Friesen and F. S. Kuhl

pp. 23-40

BibTeX  Abstract Full Text:  PDF

An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph

Sumio Masuda and Kazuo Nakajima

pp. 41-52

BibTeX  Abstract Full Text:  PDF

On the Complexity of Covering Vertices by Faces in a Planar Graph

Daniel Bienstock and Clyde L. Monma

pp. 53-76

BibTeX  Abstract Full Text:  PDF

Fast Simulation of Turing Machines by Random Access Machines

Jyrki Katajainen, Jan van Leeuwen, and Martti Penttonen

pp. 77-88

BibTeX  Abstract Full Text:  PDF

Designing a Uniform Random Number Generator Whose Subsequences are $k$-Distributed

Masanori Fushimi

pp. 89-99

BibTeX  Abstract Full Text:  PDF

Sorting and Recognition Problems for Ordered Sets

U. Faigle and Gy. Turán

pp. 100-113

BibTeX  Abstract Full Text:  PDF

Expected Performance of $m$-Solution Backtracking

David M. Nicol

pp. 114-127

BibTeX  Abstract Full Text:  PDF

Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time

Richard Cole and Uzi Vishkin

pp. 128-142

BibTeX  Abstract Full Text:  PDF

An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

Robert E. Tarjan and Christopher J. Van Wyk

pp. 143-178

BibTeX  Abstract Full Text:  PDF